Fast and Simple Algorithms for Weighted Perfect Matching
نویسندگان
چکیده
منابع مشابه
Fast and Simple Algorithms for Weighted Perfect Matching
We present two fast and simple combinatorial approximation algorithms for constructing a minimum-weighted perfect matching on complete graphs whose cost functions satisfy the triangle inequality. The first algorithm runs in O(n log n) time and is at most a factor logn worse than an optimal solution. In the second algorithm, the average time until a node is matched is O(n) and the approximation ...
متن کاملAlgorithms for Weighted Matching
We consider the matching of weighted patterns against an unweighted text. We adapt the shift-add algorithm for this problem. We also present an algorithm that enumerates all strings that produce a score higher than a given score threshold when aligned against a weighted pattern and then searches for all these strings using a standard exact multipattern algorithm. We show that both of these appr...
متن کاملFast Parallel Approximation Algorithms for Maximum Weighted Matching Problem
We present two parallel approximation algorithms for nding a matching of maximum weight in a given edge-weighted graph. To deal with unbounded weights e ciently on a PRAM, the algorithms only use the total order of the weights. That is, we assume that the algorithms can only compare with weights of edges. The rst algorithm deterministically runs in O(log n) time. Its approximation ratio is 2 3 ...
متن کاملFast Algorithms for Weighted Myriad
This paper addresses the problem of computation of the output of the Weighted Myriad Filter. Weighted Myriad Filters form a large and important class of nonlinear lters that includes linear FIR lters, with several potential applications in robust signal processing and communications in impulsive non-Gaussian environments. Just as the weighted mean and the weighted median are optimized for the G...
متن کاملEngineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a recent path heuristic. Surprisingly, this quite simple algorithm performs very well, both in terms of running time and solution quality, and, though some other methods have a better theoretical performance, it ranks among...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2004
ISSN: 1571-0653
DOI: 10.1016/j.endm.2004.03.052